The Global Packing Number for an Optical Network
نویسندگان
چکیده
The global packing number problem arises from the investigation of optimal wavelength allocation in an optical network that employs Wavelength Division Multiplexing (WDM). Consider an optical network that is represented by a connected, simple graph G. We assume all communication channels are bidirectional, so that all links and paths are undirected. It follows that there are (|G| 2 ) distinct node pairs associated with G, where |G| is the number of nodes in G. A path system P of G consists of (|G| 2 ) paths, one path to connect each of the node pairs. The global packing number of a path system P , denoted by Φ(G,P), is the minimum integer k to guarantee the existence of a mapping ω : P → {1, 2, . . . , k}, such that ω(P ) 6= ω(P ′) if P and P ′ have common edge(s). The global packing number of G, denoted by Φ(G), is defined to be the minimum Φ(G,P) among all possible path systems P . If there is no wavelength conversion along any optical transmission path for any node pair in the network, the global packing number signifies the minimum number of wavelengths required to support simultaneous communication for all pairs in the network. Partially supported by the National Natural Science Foundation of China (No. 61301107, 61174060), the Hong Kong RGC Earmarked Grant CUHK414012 and the Shenzhen Knowledge Innovation Program JCYJ20130401172046453 (Y.-H. Lo, Y. Zhang and W. S. Wong), and by Ministry of Science and Technology, Taiwan under grants MOST 104-2115-M-009-009 (H.-L. Fu). Y.-H. Lo is with the School of Mathematical Sciences, Xiamen University, Xiamen 361005, China. E-mail: [email protected] Y. Zhang is with the School of Electronic and Optical Engineering, Nanjing University of Science and Technology, Nanjing, China. E-mail: [email protected] W. S. Wong is with the Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N. T., Hong Kong. E-mail: [email protected] H.-L. Fu is with the Department of Applied Mathematics, National Chiao Tung University, Hsinchu 300, Taiwan, ROC. E-mail: [email protected] September 24, 2015 DRAFT ar X iv :1 50 9. 07 02 9v 1 [ cs .D M ] 2 3 Se p 20 15
منابع مشابه
Design of Arrayed Waveguide Grating based Optical Switch for High Speed Optical Networks
This paper demonstrates the design of an Arrayed Waveguide Gratings (AWG) based optical switch. In the design both physical and network layer analysis is performed. The physical layer power and noise analysis is done to obtain Bit Error Rate (BER). This has been found that at the higher bit rates, BER is not affected with number of buffer modules. Network layer analysis is done to obtain perfor...
متن کاملNon-Blocking Routers Design Based on West First Routing Algorithm & MZI Switches for Photonic NoC
For the first time, the 4- and 5-port optical routers are designed by using the West First routing algorithm for use in optical network on chip. The use of the WF algorithm has made the designed routers to provide non-blocking routing in photonic network on chip. These routers not only are based on high speed Mach-Zehnder switches(Which have a higher bandwidth and more thermal tolerance than mi...
متن کاملNon-Blocking Routers Design Based on West First Routing Algorithm & MZI Switches for Photonic NoC
For the first time, the 4- and 5-port optical routers are designed by using the West First routing algorithm for use in optical network on chip. The use of the WF algorithm has made the designed routers to provide non-blocking routing in photonic network on chip. These routers not only are based on high speed Mach-Zehnder switches(Which have a higher bandwidth and more thermal tolerance than mi...
متن کاملIntegration of Deep Learning Algorithms and Bilateral Filters with the Purpose of Building Extraction from Mono Optical Aerial Imagery
The problem of extracting the building from mono optical aerial imagery with high spatial resolution is always considered as an important challenge to prepare the maps. The goal of the current research is to take advantage of the semantic segmentation of mono optical aerial imagery to extract the building which is realized based on the combination of deep convolutional neural networks (DCNN) an...
متن کاملOn Open Packing Number of Graphs
In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1509.07029 شماره
صفحات -
تاریخ انتشار 2015